runtime.bmap.tophash (field)

97 uses

	runtime (current package)
		map.go#L147: 	tophash [abi.MapBucketCount]uint8
		map.go#L197: 	h := b.tophash[0]
		map.go#L448: 			if b.tophash[i] != top {
		map.go#L449: 				if b.tophash[i] == emptyRest {
		map.go#L518: 			if b.tophash[i] != top {
		map.go#L519: 				if b.tophash[i] == emptyRest {
		map.go#L562: 			if b.tophash[i] != top {
		map.go#L563: 				if b.tophash[i] == emptyRest {
		map.go#L658: 			if b.tophash[i] != top {
		map.go#L659: 				if isEmpty(b.tophash[i]) && inserti == nil {
		map.go#L660: 					inserti = &b.tophash[i]
		map.go#L664: 				if b.tophash[i] == emptyRest {
		map.go#L702: 		inserti = &newb.tophash[0]
		map.go#L780: 			if b.tophash[i] != top {
		map.go#L781: 				if b.tophash[i] == emptyRest {
		map.go#L808: 			b.tophash[i] = emptyOne
		map.go#L814: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map.go#L818: 				if b.tophash[i+1] != emptyRest {
		map.go#L823: 				b.tophash[i] = emptyRest
		map.go#L836: 				if b.tophash[i] != emptyOne {
		map.go#L986: 		if isEmpty(b.tophash[offi]) || b.tophash[offi] == evacuatedEmpty {
		map.go#L1019: 				if checkBucket>>(it.B-1) != uintptr(b.tophash[offi]&1) {
		map.go#L1024: 		if (b.tophash[offi] != evacuatedX && b.tophash[offi] != evacuatedY) ||
		map.go#L1098: 					b.tophash[i] = emptyRest
		map.go#L1282: 				top := b.tophash[i]
		map.go#L1284: 					b.tophash[i] = evacuatedEmpty
		map.go#L1324: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY
		map.go#L1333: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map.go#L1626: 		if isEmpty(src.tophash[i]) {
		map.go#L1631: 			if isEmpty(dst.tophash[pos]) {
		map.go#L1646: 		dst.tophash[pos] = src.tophash[i]
		map.go#L1758: 				if isEmpty(srcBmap.tophash[i]) {
		map.go#L1828: 			if isEmpty(b.tophash[offi]) {
		map.go#L1891: 			if isEmpty(b.tophash[offi]) {
		map_fast32.go#L45: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L94: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L147: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L152: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L186: 	insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L246: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L251: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L285: 	insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L328: 			if key != *(*uint32)(k) || isEmpty(b.tophash[i]) {
		map_fast32.go#L345: 			b.tophash[i] = emptyOne
		map_fast32.go#L349: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast32.go#L353: 				if b.tophash[i+1] != emptyRest {
		map_fast32.go#L358: 				b.tophash[i] = emptyRest
		map_fast32.go#L371: 				if b.tophash[i] != emptyOne {
		map_fast32.go#L430: 				top := b.tophash[i]
		map_fast32.go#L432: 					b.tophash[i] = evacuatedEmpty
		map_fast32.go#L448: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_fast32.go#L457: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast64.go#L45: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L94: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L147: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L152: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L186: 	insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L248: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L253: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L287: 	insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L330: 			if key != *(*uint64)(k) || isEmpty(b.tophash[i]) {
		map_fast64.go#L349: 			b.tophash[i] = emptyOne
		map_fast64.go#L353: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast64.go#L357: 				if b.tophash[i+1] != emptyRest {
		map_fast64.go#L362: 				b.tophash[i] = emptyRest
		map_fast64.go#L375: 				if b.tophash[i] != emptyOne {
		map_fast64.go#L434: 				top := b.tophash[i]
		map_fast64.go#L436: 					b.tophash[i] = evacuatedEmpty
		map_fast64.go#L452: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_fast64.go#L461: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_faststr.go#L32: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L33: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L48: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L49: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L97: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L136: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L137: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L152: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L153: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L201: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L259: 			if b.tophash[i] != top {
		map_faststr.go#L260: 				if isEmpty(b.tophash[i]) && insertb == nil {
		map_faststr.go#L264: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L305: 	insertb.tophash[inserti&(abi.MapBucketCount-1)] = top // mask inserti to avoid bounds checks
		map_faststr.go#L350: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L364: 			b.tophash[i] = emptyOne
		map_faststr.go#L368: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_faststr.go#L372: 				if b.tophash[i+1] != emptyRest {
		map_faststr.go#L377: 				b.tophash[i] = emptyRest
		map_faststr.go#L390: 				if b.tophash[i] != emptyOne {
		map_faststr.go#L449: 				top := b.tophash[i]
		map_faststr.go#L451: 					b.tophash[i] = evacuatedEmpty
		map_faststr.go#L467: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_faststr.go#L476: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check